A Simple SQP Algorithm for Constrained Finite Minimax Problems
نویسندگان
چکیده
منابع مشابه
A Simple SQP Algorithm for Constrained Finite Minimax Problems
A simple sequential quadratic programming method is proposed to solve the constrained minimax problem. At each iteration, through introducing an auxiliary variable, the descent direction is given by solving only one quadratic programming. By solving a corresponding quadratic programming, a high-order revised direction is obtained, which can avoid the Maratos effect. Furthermore, under some mild...
متن کاملA Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
In this paper we propose a new derivative-free algorithm for linearly constrained finite minimax problems. Due to the nonsmoothness of this class of problems, standard derivative-free algorithms can only locate points which satisfy weak necessary optimality conditions. In this work we define a new derivative-free algorithm which is globally convergent toward standard stationary points of the fi...
متن کاملAn SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
A common strategy for achieving global convergence in the solution of semi-innnite programming (SIP) problems, and in particular of continuous minimax problems, is to (approximately) solve a sequence of discretized problems, with a progressively ner discretization meshes. Finely discretized minimax and SIP problems, as well as other problems with many more objec-tives/constraints than variables...
متن کاملErratum: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
An error is pointed out in the local convergence proof in the quoted paper SIAM A correct proof is given. The proof of Lemma 3.14 in 2] is incorrect. Namely, proving the claim in the second sentence of the proof does not \complete the proof" as stated. To see this, note that the mathematical induction argument hinted at in that sentence merely proves that, for the innnite index set K whose exis...
متن کاملA simple algorithm for the constrained sequence problems
In this paper we address the constrained longest common subsequence problem. Given two sequences X , Y and a constrained sequence P , a sequence Z is a constrained longest common subsequence for X and Y with respect to P if Z is the longest subsequence of X and Y such that P is a subsequence of Z. Recently, Tsai [7] proposed an O(n ·m · r) time algorithm to solve this problem using dynamic prog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Scientific World Journal
سال: 2014
ISSN: 2356-6140,1537-744X
DOI: 10.1155/2014/159754